#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <set>
using namespace std;
class Solution
{
public:
    // max(min( |Xi - Xj| ))
    int maximumGap(vector<int> &nums)
    {
        if (nums.size() < 2)
            return 0;
        
        
    }
};